On the Fibonacci Numbers of Trees

نویسندگان

  • Haixing Zhao
  • Xueliang Li
چکیده

For a graph G, Fibonacci Number of G is defined as the number of subsets of V (G) in which no two vertices are adjacent in G. In this paper, we first investigate the orderings of two classes of trees by their Fibonacci numbers. Using these orderings, we determine the unique tree with the second, and respectively the third smallest Fibonacci number among all trees with n vertices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coefficient Bounds for Analytic bi-Bazileviv{c} Functions Related to Shell-like Curves Connected with Fibonacci Numbers

In this paper, we define and investigate a new class of bi-Bazilevic functions related to shell-like curves connected with Fibonacci numbers.  Furthermore, we find estimates of first two coefficients of functions belonging to this class. Also, we give the Fekete-Szegoinequality for this function class.

متن کامل

Energy of Graphs, Matroids and Fibonacci Numbers

The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.

متن کامل

A Class of Convergent Series with Golden Ratio Based on Fibonacci Sequence

In this article, a class of convergent series based on Fibonacci sequence is introduced for which there is a golden ratio (i.e. $frac{1+sqrt 5}{2}),$ with respect to convergence analysis. A class of sequences are at first built using two consecutive numbers of Fibonacci sequence and, therefore,  new sequences have been used in order  to introduce a  new class of series. All properties of the se...

متن کامل

Graphs, partitions and Fibonacci numbers

The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees with n edges and Fibonacci number > 2n−1 + 5 have diameter ≤ 4 and determine the order of these trees with respect to their Fibonacci numbers. Furthermore, it is shown that the average Fibonacci number of a star-like ...

متن کامل

An application of Fibonacci numbers into infinite Toeplitz matrices

The main purpose of this paper is to define a new regular matrix by using Fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009